Implementation of an F-Logic Kernel in CHR
نویسندگان
چکیده
Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language, rewriting constraints in relational syntax. Frame-Logic is an extension of classical predicate logic which accounts in a declarative way for many features of object-orientation. This exploratory paper gives a concise CHR implementation of Frame-Logic’s core features, including object-oriented constraint syntax, type-checking, and interaction of Frame-Logic deduction with non-monotonic overriding by inheritance.
منابع مشابه
The CHR-based Implementation of the SCIFF Abductive System
Abduction is a form of inference that supports hypothetical reasoning and has been applied to a number of domains, such as diagnosis, planning, protocol verification. Abductive Logic Programming (ALP) is the integration of abduction in logic programming. Usually, the operational semantics of an ALP language is defined as a proof procedure. The first implementations of ALP proof-procedures were ...
متن کاملTowards Agent Programming in CHR
We investigate an approach to the design and implementation of linear logic based agent systems via the linear logic semantics of Constraint Handling Rules (CHR). The intuition behind our approach is simple: Linear logic provides strong logical foundations to reason, verify and specify agent systems beyond the limitations of classical logics, while with CHR, one can implement and analyse agent ...
متن کاملUniversity Halle - Wittenberg Institute of Computer Science 22 nd Workshop on ( Constraint ) Logic Programming
The rule-based programming language Constraint Handling Rules (CHR) has been introduced to ease the development and implementation of constraint solvers. Currently, several CHR libraries exist in languages such as Prolog, Haskell and Java. The K.U.Leuven JCHR system is a high-performance integration of Constraint Handling Rules (CHR) and Java. JCHR is currently by far the most efficient impleme...
متن کاملThe CHR-based Implementation of a System for Generation and Confirmation of Hypotheses
Talks/Presentations/GLP Meeting/Coffee/Registration are in room O28/1002. 19th Workshop on (Constraint) Logic Programming, University Ulm, Germany, February 21 23, 2005. Dietmar Seipel and Klaus Praetor: XML Transformations based on Logic Programming M.Alberti, F.Chesani, M.Gavanelli, E.Lamma, P.Mello, P.Torroni: The CHR-based Implementation of a System for Generation and Confirmation of Hypoth...
متن کاملProbabilistic Abductive Logic Programming in Constraint Handling Rules
A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given. Compared with other probabilistic versions of abductive logic programming, the approach is characterized by higher genera...
متن کامل